Symplectic Multi-time Step Parareal Algorithms Applied to Molecular Dynamics
نویسندگان
چکیده
Abstract. In this paper we propose a new parareal algorithm for parallelizing in time molecular dynamics problems. The original structure of this algorithm allows one to consider multi-time stepping, namely two levels of temporal discretization, providing a larger range for the fine and coarse solvers definition. We also prove the symplecticity of this method, which is an expected behavior of the molecular dynamics integrators. The relevance of this algorithm is numerically demonstrated by applying it to three-dimensional atomic lattices on parallel computer architectures. For lattices of more than 20000 atoms we get attractive speed-up with proper choice for the coarse solver definition and for the number of processors.
منابع مشابه
Symplectic parareal
The parareal algorithm, recalled in section 2 below, allows one to solve evolution equations on (possibly massively) parallel architectures. The two building blocks of the algorithms are a coarse-discretization predictor (solved sequentially) and a fine-discretization corrector (solved in parallel). First developed in Lions et al. (2000) and slightly modified in Bal and Maday (2002), which is t...
متن کاملParareal in Time for Dynamic Simulations of Power Systems
In recent years, there have been significant developments in parallel algorithms and high performance parallel computing platforms. Parareal in time algorithm has become popular for long transient simulations (e.g., molecular dynamics, fusion, reacting flows). Parareal is a parallel algorithm which divides the time interval into sub-intervals and solves them concurrently. This paper investigate...
متن کاملParallelization in Time of (stochastic) Ordinary Differential Equations
This paper analyzes some properties of the parareal algorithm, which can be used to parallelize the time discretizations of differential equations. The parareal algorithm proceeds as follows. Firstly, a coarse time step is used to solve the equation sequentially on a given time interval. Secondly, a fine discretization is used to solve the evolution equation on each coarse time step. This step ...
متن کاملForce-gradient nested multirate methods for Hamiltonian systems
Force-gradient decomposition methods are used to improve the energy preservation of symplectic schemes applied to Hamiltonian systems. If the potential is composed of different parts with strongly varying dynamics, this multirate potential can be exploited by coupling force-gradient decomposition methods with splitting techniques for multi-time scale problems to further increase the accuracy of...
متن کاملPareto Optimization of Two-element Wing Models with Morphing Flap Using Computational Fluid Dynamics, Grouped Method of Data handling Artificial Neural Networks and Genetic Algorithms
A multi-objective optimization (MOO) of two-element wing models with morphing flap by using computational fluid dynamics (CFD) techniques, artificial neural networks (ANN), and non-dominated sorting genetic algorithms (NSGA II), is performed in this paper. At first, the domain is solved numerically in various two-element wing models with morphing flap using CFD techniques and lift (L) and drag ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009